Excluding pairs of graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Excluding pairs of graphs

For a graph G and a set of graphs H, we say that G is H-free if no induced subgraph of G is isomorphic to a member of H. Given an integer P > 0, a graph G, and a set of graphs F , we say that G admits an (F , P )-partition if the vertex set of G can be partitioned into P subsets X1, . . . ,XP , so that for every i ∈ {1, . . . , P}, either |Xi| = 1, or the subgraph of G induced by Xi is {F}-free...

متن کامل

Excluding induced subgraphs: Critical graphs

Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with chromatic number k + 1 almost all graphs not containing H as a subgraph are k-colorable if and only if H contains a color-critical edge. We strengthen the concept of H-free to induced subgraph containment, proving that...

متن کامل

Excluding Subdivisions of Bounded Degree Graphs

Let H be a fixed graph. What can be said about graphs G that have no subgraph isomorphic to a subdivision of H? Grohe and Marx proved that such graphs G satisfy a certain structure theorem that is not satisfied by graphs that contain a subdivision of a (larger) graph H1. Dvořák found a clever strengthening—his structure is not satisfied by graphs that contain a subdivision of a graph H2, where ...

متن کامل

Quickly Excluding K2, r from Planar Graphs

We prove that any planar graph that does not contain K2,r as a minor has treewidth ≤ r + 2.

متن کامل

Linear Kernels on Graphs Excluding Topological Minors

We show that problems that have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of H-topological-minor free graphs, for an arbitrary fixed graph H . This builds on earlier results by Bodlaender et al. on graphs of bounded genus [2] and by Fomin et al. on H-minor-free graphs [9]. Our framework encompasses several problems, the prominent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2014

ISSN: 0095-8956

DOI: 10.1016/j.jctb.2014.01.001